Efficient Craig interpolation for linear Diophantine (dis)equations and linear modular equations
نویسندگان
چکیده
منابع مشابه
Efficient Craig Interpolation for Linear Diophantine (Dis)Equations and Linear Modular Equations
The use of Craig interpolants has enabled the development of powerful hardware and software model checking techniques. Efficient algorithms are known for computing interpolants in rational and real linear arithmetic. We focus on subsets of integer linear arithmetic. Our main results are polynomial time algorithms for obtaining proofs of unsatisfiability and interpolants for conjunctions of line...
متن کاملA Quantifier Elimination Algorithm for Linear Modular Equations and Disequations
We present a layered bit-blasting-free algorithm for existentially quantifying variables from conjunctions of linear modular (bitvector) equations (LMEs) and disequations (LMDs). We then extend our algorithm to work with arbitrary Boolean combinations of LMEs and LMDs using two approaches – one based on decision diagrams and the other based on SMT solving. Our experiments establish conclusively...
متن کاملDiophantine Equations Related with Linear Binary Recurrences
In this paper we find all solutions of four kinds of the Diophantine equations begin{equation*} ~x^{2}pm V_{t}xy-y^{2}pm x=0text{ and}~x^{2}pm V_{t}xy-y^{2}pm y=0, end{equation*}% for an odd number $t$, and, begin{equation*} ~x^{2}pm V_{t}xy+y^{2}-x=0text{ and}text{ }x^{2}pm V_{t}xy+y^{2}-y=0, end{equation*}% for an even number $t$, where $V_{n}$ is a generalized Lucas number. This pape...
متن کاملCraig Interpolation for Linear Temporal Languages
We study Craig interpolation for fragments and extensions of propositional linear temporal logic (PLTL). We consider various fragments of PLTL obtained by restricting the set of temporal connectives and, for each of these fragments, we identify its smallest extension that has Craig interpolation. Depending on the underlying set of temporal operators, this extension turns out to be one of the fo...
متن کاملSolving Linear Diophantine Equations
An overview of a family of methods for nding the minimal solutions to a single linear Diophantine equation over the natural numbers is given. Most of the formal details were dropped, some illustrations that might give some intuition on the methods being presented instead.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Formal Methods in System Design
سال: 2009
ISSN: 0925-9856,1572-8102
DOI: 10.1007/s10703-009-0069-x